package Ex1;

public interface BinarySearchTree<E> {
	
	public int size();
	public boolean isEmpty();
	public void instert(E e);
	public void remove(E e);
	public Position<E> search(E e);

}
